Network Community Detection on Small Quantum Computers
نویسندگان
چکیده
منابع مشابه
Multiple Network Alignment on Quantum Computers
Comparative analyses of graph structured datasets underly diverse problems. Examples of these problems include identification of conserved functional components (biochemical interactions) across species, structural similarity of large biomolecules, and recurring patterns of interactions in social networks. A large class of such analyses methods quantify the topological similarity of nodes acros...
متن کاملQuantum Gravity on Computers
Some times Thomas Hardy has been compared to Dostoevski, but Dostoevski is an incomparably ner artist. If Dostoevski's works could be compared to some of say, Rubens' paintings, then Hardy's are neatly nished diagrams drawn on graph paper with ruler and compass! Compare for instance the tragedy to Tess with that of Sonia, or the culmination of the forces in Raskolnikoo's confession with the mel...
متن کاملLocal Community Detection Based on Small Cliques
Community detection aims to find dense subgraphs in a network. We consider the problem of finding a community locally around a seed node both in unweighted and weighted networks. This is a faster alternative to algorithms that detect communities that cover the whole network when actually only a single community is required. Further, many overlapping community detection algorithms use local comm...
متن کاملOverlapping Community Detection based on Network Decomposition
Community detection in complex network has become a vital step to understand the structure and dynamics of networks in various fields. However, traditional node clustering and relatively new proposed link clustering methods have inherent drawbacks to discover overlapping communities. Node clustering is inadequate to capture the pervasive overlaps, while link clustering is often criticized due t...
متن کاملNetwork Community Detection on Metric Space
Community detection in a complex network is an important problem of much interest in recent years. In general, a community detection algorithm chooses an objective function and captures the communities of the network by optimizing the objective function, and then, one uses various heuristics to solve the optimization problem to extract the interesting communities for the user. In this article, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advanced Quantum Technologies
سال: 2019
ISSN: 2511-9044,2511-9044
DOI: 10.1002/qute.201900029